Circulant matrices with orthogonal rows and off-diagonal entries of absolute value 1
نویسندگان
چکیده
منابع مشابه
Factoring Matrices into the Product of Circulant and Diagonal Matrices
A generic matrix A ∈ Cn×n is shown to be the product of circulant and diagonal matrices with the number of factors being 2n−1 at most. The demonstration is constructive, relying on first factoring matrix subspaces equivalent to polynomials in a permutation matrix over diagonal matrices into linear factors. For the linear factors, the sum of two scaled permutations is factored into the product o...
متن کاملA simple observation on random matrices with continuous diagonal entries
Let T be an n × n random matrix, such that each diagonal entry Ti,i is a continuous random variable, independent from all the other entries of T . Then for every n × n matrix A and every t ≥ 0 P [ | det(A+ T )| ≤ t ] ≤ 2bnt, where b > 0 is a uniform upper bound on the densities of Ti,i.
متن کاملExistence of Matrices with Prescribed Off-Diagonal Block Element Sums
Necessary and sufficient conditions are proven for the existence of a square matrix, over an arbitrary field, such that for every principal submatrix the sum of the elements in the row complement of the submatrix is prescribed. The problem is solved in the cases where the positions of the nonzero elements of A are contained in a given set of positions, and where there is no restriction on the p...
متن کاملMaximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector
It is well-known that the maximum exponent that an n-by-n boolean primitive circulant matrix can attain is n− 1. In this paper, we find the maximum exponent that n-by-n boolean primitive circulant matrices with constant number of nonzero entries in its generating vector can attain. We also give matrices attaining such exponents. Solving this problem we also solve two equivalent problems: 1) fin...
متن کاملMaximum Exponent of Boolean Circulant Matrices with Constant Number of Nonzero Entries in their Generating Vector
It is well-known that the maximum exponent that an n-by-n boolean primitive circulant matrix can attain is n − 1. In this paper, we find the maximum exponent attained by n-by-n boolean primitive circulant matrices with constant number of nonzero entries in their generating vector. We also give matrices attaining such exponents. Solving this problem we also solve two equivalent problems: 1) find...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematics
سال: 2021
ISSN: 2336-1298
DOI: 10.2478/cm-2021-0005